Cost Based Filtering vs. Upper Bounds for Maximum Clique
نویسنده
چکیده
In this paper we consider a branch-and-bound algorithm for the maximum clique problem. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Doing this, we can reduce the number of choice points visited by a typical factor of 10 – 50. Additionally, we present a taxonomy of upper bounds used in the OR community for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of these well-known bounds for the maximum clique problem.
منابع مشابه
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of the...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملVariable Neighborhood Search for Extremal Graphs, 24. Results about the clique number
A set of vertices S in a graph G is a clique if any two of its vertices are adjacent. The clique number ω is the maximum cardinality of a clique in G. A series of best possible lower and upper bounds on the difference, sum, ratio or product of ω and some other common invariants of G were obtained by the system AGX 2, and most of them proved either automatically or by hand. In the present paper,...
متن کاملA sequential elimination algorithm for computing bounds on the clique number of a graph
We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bound on the clique number of a graph, we present a sequential elimination algorithm which is guaranteed to improve upon that upper bound. Computational experiments on DIMACS instances show that, on average, this algorithm can reduce the gap be...
متن کاملExact Bounds on the Order of the Maximum Clique of a Graph
The paper reviews some of the existing exact bounds to the maximum clique of a graph and successively presents a new upper and a new lower bound. The new upper bound is !6 n − rank 1 A=2, where 1 A is the adjacency matrix of the complementary graph, and derives from a formulation of the maximum clique problem in complex space. The new lower bound is !¿ 1=(1− gj∗( ∗)) (see text for details) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002